Binary PSO for Web Service Location-Allocation

Web services are independent programmable application components which scatter over the Internet. Due to the improvement on local computing power and development on high-speed Internet, network latency has a significant impact on determining the service response time. Thus, physical locations of web services and users should be taken into account for web service composition. In this paper, we propose a new solution based on the binary PSO-based approach to allocate the service locations. Although several heuristic approaches have been proposed for web service location-allocation, to our best knowledge, PSO-based approach is the first attempt to solve the problem. A simulated experiment is done using WS-DREAM data set with five different complexities. To compare with two GA-based approaches, the proposed BPSO approach has advantages in most situations.